Evolutionary hyper-heuristic for solving the strip-packing problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem
In this paper, we present a parallel hyper-heuristic approach for two-dimensional rectangular strip-packing problems (2DSP). This is an island model with a special master-slave structure, and in all the islands we run a memetic algorithm-based hyper-heuristic (HH). The basic technique of this HH is a memory-based evolutionary technique, the “extended virtual loser” (EVL). The memory-based techn...
متن کاملUpper Bounds for Heuristic Approaches to the Strip Packing Problem
We consider the twoand three-dimensional strip packing problem (SPP): given a set of rectangular items and a strip, find the minimal height needed to pack all items. Rotation of the items is not permitted. We present an algorithm for the two-dimensional SPP, which improves the packing of the well-known FFDH-heuristic and state theoretical results of this algorithm. Furthermore, we prove new upp...
متن کاملA Meta-heuristic Algorithm for the Strip Rectangular Packing Problem
A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...
متن کاملA unified hyper-heuristic framework for solving bin packing problems
One-and two-dimensional packing and cutting problems occur in many commercial contexts, and it is often important to be able to get good-quality solutions quickly. Fairly simple deterministic heuristics are often used for this purpose, but such heuristics typically find excellent solutions for some problems and only mediocre ones for others. Trying several different heuristics on a problem adds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of The Textile Institute
سال: 2019
ISSN: 0040-5000,1754-2340
DOI: 10.1080/00405000.2018.1550136